Sack Layout

نویسنده

  • Anthony Sack
چکیده

Recently there has been interest in DWDM-based optical networks that are assumed to employ exactly two working fibers uniformly on every span (or “link”). At the fiber level such networks are referred to as homogeneous networks. An interesting and highly efficient strategy for protection of such networks is to use a single dark-fiber pcycle formed on a Hamiltonian cycle (if it exists). We show that in a homogeneous Hamiltonian network, a Hamiltonian p-cycle is the most efficient overall solution, although interestingly it does not always correspond to the individually most efficient p-cycle that can be formed. We also consider p-cycle planning in non-Hamiltonian but homogeneous networks and introduce the concept of a semi-homogenous network, specifically linked to the p-cycle concept. The proposed semi-homogeneous class of network actually realizes the theoretical lower bound on span-restorable networks in terms of network redundancy. Such networks also provide a strategy to accommodate certain patterns of capacity growth beyond a homogenous network without any increase in protection capacity. The work also demonstrates and explains why a single Hamiltonian p-cycle is not as efficient as a specifically optimized set of individual p-cycles in a “capacitated” (non-homogeneous) network where the working capacity on each span varies in a general way. These discussions provide new options for DWDM network architecture and also clarify some possible confusions about the applicability of Hamiltonian p-cycles and generalized sets of p-cycles. Hamiltonian p-Cycles for Fiber-Level Protection in Homogeneous and Semi-Homogeneous Optical Networks 1 By span we mean a link in the physical layer graph. A measure of physical capacity such as number of fibers or wavelengths is associated with a

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Pacing to Improve SACK TCP Resilience

Abstract The Transmission Control Protocol (TCP) was designed to provide a reliable end-to-end connection. The most up-to-date TCP version, SACK TCP, was designed to be capable of surviving multiple segment loss. SACK TCP tends to send out segments in clusters and congest bottleneck routers, which could potentially degrade SACK TCP performance significantly. In this paper we present α-min paced...

متن کامل

Worst-case Performance Limitation of Tcp Sack and a Feasible Solution

In the present implementation of Transmission Control Protocol (TCP) selective acknowledgment (SACK), every SACK block needs 8 bytes to carry information about the received packets, back to the sender. Since TCP Options field has a fixed length, there is a limit on the number of SACK block that can be carried by the acknowledgment packets. Under some error conditions, this limitation can force ...

متن کامل

SACK TCP Resilience Improvement with OPNET

SACK TCP was designed to be capable of surviving multiple segment loss. This can occur during network congestion as well as network failure. We studied the resilience behavior of SACK TCP in both cases and found that there is a critical point at which the behavior of SACK TCP changes significantly. If the number of lost segments in one transmission window is greater than this critical number, S...

متن کامل

Analytic models and comparative study of the latency and steady-state throughput of TCP Tahoe, Reno and SACK

Continuing the process of improvements made to TCP through the addition of new algorithms in Tahoe and Reno, TCP SACK aims to provide robustness to TCP in the presence of multiple losses from the same window. In this paper we present analytic models to estimate the latency and steady-state throughput to TCP Tahoe, Reno and SACK and validate our models using both simulations and TCP traces colle...

متن کامل

Using Selective Acknowledgements to Reduce the Memory Footprint of Replicated Services

This paper proposes the use of Selective Acknowledgements (SACK) from clients to services as a method for reducing the memory footprint of replicated services. The paper discusses the general concept of SACK in replicated services and presents a specific implementation of SACK for an existing replication infrastructure. Performance measurements exhibiting the effectiveness of SACK are also pres...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004